Optimization Methods for Mixed Integer Weakly Concave Programming Problems
نویسندگان
چکیده
منابع مشابه
Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملOn Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
Concave Mixed-Integer Quadratic Programming is the problem of minimizing a concave quadratic polynomial over the mixed-integer points in a polyhedral region. In this work we describe two algorithms that find an -approximate solution to a Concave Mixed-Integer Quadratic Programming problem. The running time of the proposed algorithms is polynomial in the size of the problem and in 1/ , provided ...
متن کاملDerivative-Free Methods for Mixed-Integer Constrained Optimization Problems
Methods which do not use any derivative information are becoming popular among researchers, since they allow to solve many real-world engineering problems. Such problems are frequently characterized by the presence of discrete variables, which can further complicate the optimization process. In this paper, we propose derivative-free algorithms for solving continuously differentiable Mixed Integ...
متن کاملConcave Quadratic Cuts for Mixed-Integer Quadratic Problems
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold for any vector in the integer lattice Z, and show that adding these inequalities to a mixed-integer nonconvex QCQP can improve the SDP-based bound on the opt...
متن کاملGlobal optimization of mixed-integer bilevel programming problems
Global optimization of mixed-integer nonlinear bilevel optimization problems is addressed using a novel technique. For problems where integer variables participate in both inner and outer problems, the outer level may involve general mixed-integer nonlinear functions. The inner level may involve functions that are mixed-integer nonlinear in outer variables, linear, polynomial, or multilinear in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2014
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-014-0046-y